Dominating set - PDFSEARCH.IO - Document Search Engine

Dominating set
Results: 145

#	Item
31	Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Förster ETH Zurich – Distributed Computing – www.disco.ethz.ch Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2015-05-18 12:16:33 NP-complete problems Dominating set Approximation algorithm Domination Connected dominating set Domatic number
32	Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Foerster∗ Abstract In this paper we study the NP-complete problem of finding small k-dominating sets in general graphs, which allow k − 1 nodes to Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2015-05-18 12:16:23 Graph theory Mathematics Computational complexity theory NP-complete problems Dominating set Independent set Vertex cover Connected dominating set Set cover problem Line graph Metric k-center Domatic number
33	A new characterization of Pk -free graphs Eglantine Camby Universit´e Libre de Bruxelles D´epartement de Math´ematique Boulevard du Triomphe, 1050 Brussels, Belgium Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2015-02-09 05:54:36 Graph theory Mathematics NP-complete problems Graph coloring Hypergraph Dominating set Ear decomposition Graph Line graph Modular decomposition
34	On Approximation Complexity of Edge Dominating Set Problem in Dense Graphs Richard Schmied∗ Claus Viehmann† Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2011-06-03 08:54:09
35	Hitting Set Algorithms for Fast Data Recovery in the Face of Geographic Correlated Attacks Alon Efrat Esther Ezra Add to Reading List Source URL: www.cims.nyu.edu Language: English - Date: 2013-07-29 14:22:26 Computational geometry Ε-net Connectivity NP Erasure code Planar graph NP-complete problems Dominating set Tutte polynomial Graph theory Theoretical computer science Mathematics
36	Seminar on Algorithms and Geometry 2014B – Problem Set 3 Robert Krauthgamer May 15, 2014 We discussed in class low-distortion metric embeddings, and in particular a probabilistic embedding into dominating trees. Add to Reading List Source URL: www.wisdom.weizmann.ac.il - Date: 2014-05-15 11:57:38
37	An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem Arash Asadpour∗ ‡ Michel X. Goemans† Add to Reading List Source URL: www.stanford.edu Language: English - Date: 2009-10-28 12:34:47 Spanning tree Loop-erased random walk Minimum spanning tree Chernoff bound Eulerian path NP-complete problems Dominating set Tutte polynomial Graph theory Mathematics Theoretical computer science
38	Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs Philip N. Klein1 , Claire Mathieu2,3 , and Hang Zhou3 1 Brown University, United States Add to Reading List Source URL: www.normalesup.org Language: English - Date: 2015-03-16 13:08:36 NP-complete problems Cluster analysis Correlation clustering Graph Minor Planar graph Dominating set Independent set Matroid theory Graph theory Mathematics Theoretical computer science
39	Local Distributed Decision∗ Pierre Fraigniaud† Amos Korman† David Peleg‡ Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2011-10-30 17:16:12 NP-complete problems Network flow Operations research Probabilistic complexity theory Randomized algorithm Modular decomposition Dominating set Flow network XTR Theoretical computer science Mathematics Graph theory
40	Better bounds for matchings in the streaming model Michael Kapralov∗ arXiv:1206.2269v2 [cs.DS] 26 JulDecember 6, 2013 Add to Reading List Source URL: arxiv.org Language: English - Date: 2013-12-06 12:53:09 NP-complete problems Combinatorial optimization Matching Degree Maximum flow problem Graph coloring Dominating set Mathematics Graph theory Theoretical computer science

UPDATE